Tame decompositions and collisions
نویسندگان
چکیده
منابع مشابه
A Fundamental Theorem on Decompositions of the Sphere into Points and Tame Arcs
1. Introduction. R. H. Bing showed that an upper semicontinuous decomposition of £3 into points and tame arcs did not necessarily produce a decomposition space topologically equivalent to E3 [1J. M. L. Curtis and R. L. Wilder showed [2] that the decomposition space of Bing was a homotopy manifold, thus negatively answering a question proposed by Griffiths [3J. R. Rosen recently announced [4] a ...
متن کاملTame Flows
The tame flows are “nice” flows on “nice” spaces. The nice (tame) sets are the pfaffian sets introduced by Khovanski, and a flow Φ : R×X → X on pfaffian set X is tame if the graph of Φ is a pfaffian subset of R×X×X . Any compact tame set admits plenty tame flows. We prove that the flow determined by the gradient of a generic real analytic function with respect to a generic real analytic metric ...
متن کاملTame Dynamics and Robust Transitivity
One main task of smooth dynamical systems consists in finding a good decomposition into elementary pieces of the dynamics. This paper contributes to the study of chain-recurrence classes. It is known that Cgenerically, each chain-recurrence class containing a periodic orbit is equal to the homoclinic class of this orbit. Our result implies that in general this property is fragile. We build a C-...
متن کاملTame structures
We study various notions of “tameness” for definably complete expansions of ordered fields. We mainly study structures with locally o-minimal open core, d-minimal structures, and dense pairs of d-minimal structures.
متن کاملInfinite-dimensional versions of the primary, cyclic and Jordan decompositions
The famous primary and cyclic decomposition theorems along with the tightly related rational and Jordan canonical forms are extended to linear spaces of infinite dimensions with counterexamples showing the scope of extensions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2016
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2015.11.017